Consistency-Driven Probabilistic Quorum System Construction for Improving Operation Availability
نویسندگان
چکیده
Pessimistic quorum-based data replication strategies generally strive for maximizing operation availabilities while adhering to a strict consistency notion. Unfortunately, their operation availabilities are strictly upper-bounded. Probabilistically relaxing the consistency notion permits to overcome this bound, introducing probabilistic data replication strategies that allow for a data consistency vs. operation availabilities trade-off. We present two construction algorithms transforming strict quorum systems into probabilistic ones and compare them in terms of operation availabilities and degree of data consistency.
منابع مشابه
Probabilistic quorum systems for dependable distributed data management
Among failure-prone and dynamic distributed systems there is a significant class of systems that strive for high availability and can function with inconsistent data. Examples include flight reservation systems which allow overbooking or emergency ambulance systems which return informative responses to time-critical queries. Data replication is a well-known technique for tolerating failures and...
متن کاملEffective Quorum Construction for Consistency Management in Mobile Ad Hoc Networks
In mobile ad hoc networks (MANETs), there are many applications in which mobile users share information by accessing data held by other users. Typical examples are collaborative rescue operations at a disaster site, military operations, and exchange of word-of-mouth information in a shopping mall. For such applications, preventing the deterioration of data availability at the point of network p...
متن کاملElastic Replication for Scalable Consistent Services
Most of the scalable and high-performance services used in datacenters today provide relaxed consistency guarantees in order to achieve good responsiveness. One reason for this is that it is believed that expensive majority-based consensus protocols are needed in order to provide strong consistency in asynchronous and partially synchronous environments such as a datacenter or the Internet. In t...
متن کاملTimed Quorum System for Large-Scale and Dynamic Environments
This paper presents Timed Quorum System (TQS), a new quorum system especially suited for large-scale and dynamic systems. TQS requires that two quorums intersect with high probability if they are used in the same small period of time. It proposed an algorithm that implements TQS and that verifies probabilistic atomicity: a consistency criterion that requires each operation to respect atomicity ...
متن کاملv er si on 1 - 4 F eb 2 00 8 Timed Quorum Systems for Large - Scale and Dynamic Environments ⋆
This paper presents Timed Quorum System (TQS), a new quorum system especially suited for large-scale and dynamic systems. TQS requires that two quorums intersect with high probability if they are used in the same small period of time. It proposed an algorithm that implements TQS and that verifies probabilistic atomicity: a consistency criterion that requires each operation to respect atomicity ...
متن کامل